منابع مشابه
Adaptive Constraint Pushing in Frequent Pattern Mining
Pushing monotone constraints in frequent pattern mining can help pruning the search space, but at the same time it can also reduce the effectiveness of anti-monotone pruning. There is a clear tradeoff. Is it better to exploit more monotone pruning at the cost of less antimonotone pruning, or viceversa? The answer depends on characteristics of the dataset and the selectivity of constraints. In t...
متن کاملPushing Frequency Constraint to Utility Mining Model
Traditional association rules mining (ARM) only concerns the frequency of itemsets, which may not bring large amount of profit. Utility mining only focuses on itemsets with high utilities, but the number of rich-enough customers is limited. To overcome the weakness of the two models, we propose a novel model, called general utility mining, which takes both frequency and utility into considerati...
متن کاملgPrune: A Constraint Pushing Framework for Graph Pattern Mining
In graph mining applications, there has been an increasingly strong urge for imposing user-specified constraints on the mining results. However, unlike most traditional itemset constraints, structural constraints, such as density and diameter of a graph, are very hard to be pushed deep into the mining process. In this paper, we give the first comprehensive study on the pruning properties of bot...
متن کاملSelections
It was not until the sixteenth century that dead bodies were submitted to medico-legal investigation. The horror which human dissections inspired in the ancients, and the religious awe with which they beheld the mortal wreck of their fellows, not only retarded the progress of anatomy and physiology, but excluded the light of medicine from the researches of the forum. The Jewish law, indeed, con...
متن کاملSelections Reprinted
MR1631259 (2000d:11019) 11B25; 11N13 Gowers, W. T. A new proof of Szemerédi’s theorem for arithmetic progressions of length four. Geometric and Functional Analysis 8 (1998), no. 3, 529–551. This remarkable paper gives a new proof that every subset of the integers with positive density must contain arithmetic progressions of length four. This was conjectured by P. Erdős and P. Turán [J. London M...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic Programming
سال: 1993
ISSN: 0743-1066
DOI: 10.1016/0743-1066(93)90048-l